package algorithm.test1Tree.testOld;

/**
 * @program: javaSE
 * @description: ${description}
 * @author: majian8
 * @create: 2019-07-23 17:39
 **/
public class Node {
    //节点数据
    int data;
    //左子节点的引用
    Node leftChild;
    //右子节点的引用
    Node rightChild;
    //表示节点是否被删除
    boolean isDelete;

    public Node(int data) {
        this.data = data;
    }

    //打印节点内容
    public void display() {
        System.out.println(data);
    }

}
